Parametrization for Order-Sorted Algebraic Specification

نویسنده

  • Axel Poigné
چکیده

We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study free constructions for order-sorted algebras and relate the various approaches to order-sorting. Then we analyse parameter passing, the result being that the notion of ordersorted specification has to be restricted in order to establish our main result, namely, that parameter passing satisfies the same correctness criteria as in the case of many-sorted algebras.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application and Formal Specification of Sorted Term-Position Algebras

Sorted term-position algebras are an extension of term algebras. In addition to sorted terms with constructor and selector functions, they provide term positions as algebra elements and functions that relate term positions. This paper describes possible applications of termposition algebras and investigates their formal specification in existing specification frameworks. In particular, it prese...

متن کامل

Towards Behavioral Maude: Behavioral Membership Equational Logic

How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80’s, and further developed into the hidden-sorted logic approach by researchers at Oxford, UC San Diego, and Kanazawa offers some attractive answers, and has been i...

متن کامل

A Formal Specification Framework for Object-Oriented Distributed Systems

ÐIn this paper, we present the Concurrent Object-Oriented Petri Nets (CO-OPN/2) formalism devised to support the specification of large distributed systems. Our approach is based on two underlying formalisms: order-sorted algebra and algebraic Petri nets. With respect to the lack of structuring capabilities of Petri nets, CO-OPN/2 has adopted the object-oriented paradigm. In this hybrid approac...

متن کامل

Proving Correctness of Refinement and Implementation

The notions of state and observable behaviour are fundamental to many areas of computer scjpnce. Hidden sorted algebra, an extension of many sorted al~bra. captures these notions through hidden sorts and the behavioural satisfaction of equations. This makes it a powerful formalisation of abstract machines, and many results suggest that it is also suitable for the semanticl:i of the object parad...

متن کامل

Test Selection for Specification-Based Unit Testing of Object-Oriented Software based on Formal Specifications

ion in CO-OPN/2 is provided by two kinds of sorts: algebraic sorts and class types. Not all entities in a CO-OPN/2 system are objects, some of them are merely algebraic values, without identity. Thus CO-OPN/2 stands in the class of hybrid object-oriented specification languages. Sorts provide services, called functions for algebraic sorts, and methods for objects. Methods are special transition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 40  شماره 

صفحات  -

تاریخ انتشار 1990